-
1 coalescing nodes
Большой англо-русский и русско-английский словарь > coalescing nodes
-
2 coalescing nodes
Вычислительная техника: объединяемые узлы -
3 coalescing nodes
English-Russian dictionary of computer science and programming > coalescing nodes
-
4 объединяемые узлы
Большой англо-русский и русско-английский словарь > объединяемые узлы
-
5 node
1) узел (в сетях - точка присоединения к сети, устройство, подключенное к сети)2) т. граф. узел ( сети)3) матем. точка пересечения•- alpha node
- ancestor node
- AND-node
- backbone node
- backend node
- backward node
- beta node
- central node
- child node
- cicuit node
- coalescing nodes
- collector node
- computational node
- concept node
- datum node
- daughter node
- descendant node
- destination node
- end node
- expert node
- fail-insane node
- fail-stop node
- father node
- faulty node
- firable node
- forward node
- functional node
- grain node
- interaction nodes
- intermediated node
- internal node
- leaf node
- master node
- network node
- nonleaf node
- OR-node
- packet switch node
- parent node
- parent-sibling node
- predicate node
- process node
- processor node
- production node
- recovery node
- reference node
- root node
- rule node
- session node
- sibling node
- slave node
- starting node
- storage node
- strong node
- subsumming node
- switch node
- switching node
- terminal node
- weak nodeEnglish-Russian dictionary of computer science and programming > node
См. также в других словарях:
Register allocation — In compiler optimization, register allocation is the process of multiplexing a large number of target program variables onto a small number of CPU registers. The goal is to keep as many operands as possible in registers to maximise the execution… … Wikipedia
Coalesced hashing — example. For purposes of this example, collision buckets are allocated in increasing order, starting with bucket 0. Coalesced hashing, also called coalesced chaining, is a strategy of collision resolution in a hash table that forms a hybrid of… … Wikipedia
Reference counting — In computer science, reference counting is a technique of storing the number of references, pointers, or handles to a resource such as an object or block of memory. It is typically used as a means of deallocating objects which are no longer… … Wikipedia
ARPANET — For the producer, see Gerald Donald. ARPANET logical map, March 1977 The Advanced Research Projects Agency Network (ARPANET), was the world s first operational packet switching network and the core network of a set that came to compose the global … Wikipedia
Static single assignment form — In compiler design, static single assignment form (often abbreviated as SSA form or SSA) is an intermediate representation (IR) in which every variable is assigned exactly once. Existing variables in the original IR are split into versions , new… … Wikipedia
Networked Advocacy — or net centric advocacy refers to a specific type of advocacy. While networked advocacy has existed for centuries, it has become significantly more efficacious in recent years due in large part to the widespread availability of the internet,… … Wikipedia
Server Message Block — In computer networking, Server Message Block (SMB), also known as Common Internet File System (CIFS, /ˈsɪfs … Wikipedia